Nuprl Lemma : ecl-realizes 11,40

i:Id, ds:fpf(Id; x.Type), da:fpf(Knd; k.Type), A:ecl(dsda), snd:msg-spec(dsda),
upd:update-spec(dsda).
normal-ds{i:l}
normal-ds(ds)
 normal-da{i:l}
 normal-da(da)
 l_all(ecl-kinds(A);
 l_all(Knd;
 l_all(k.(((isrcv(k))  (i = destination(lnk(k))  Id))  (fpf-dom(Kind-deq; kda))))
 update-spec-decl(updds)
 msg-spec-loc-decl(sndida)
 ((fpf-dom(id-deq; mkid{ecl:ut2}; ds)))
 R-realizes{i:l}
 R-realizes(ecl-machine{ecl:ut2}
 R-realizes(ecl-machine(idsdaAsndupd);
 R-realizes(es.ecl-mng{i:l}
 R-realizes(es.ecl-mng(esidsdaAsndupd)) 
latex


Definitionss = t, ecl-trans-tuple{i:l}(dsda), ecl-trans(x), normal-type{i:l}(T), mkid{$x:ut2}, False, A, msg-spec-loc-decl(sndida), update-spec-decl(updds), EqDecider(T), isrcv(k), destination(l), lnk(k), fpf-dom(eqxf), Kind-deq, fpf-all(Aeqfx,v.P(x;v)), normal-da{i:l}(da), update-spec(dsda), normal-ds{i:l}(ds), msg-spec(dsda), fpf-cap(feqxz), id-deq, ecl(dsda), msg-item(dsdakl), t.1, x.A(x), t.2, rec(x.A(x)), ma-valtype(dak), , atom{$n:n}, {x:AB(x)} , ecl-machine{$ecl:ut2}(idsdaAsndupd), es realizer ind, xt(x), es_realizer{i:l}, x,y,z,wt(x;y;z;w), rationals, x,y,z,u,v,wt(x;y;z;u;v;w), decl-type{i:l}(dsx), x,y,z,w,vt(x;y;z;w;v), fpf(Aa.B(a)), finite-prob-space, , decl-state(ds), IdLnk, x,y,zt(x;y;z), R-realizes{i:l}(Res.P(es)), ecl-mng{i:l}(esidsdaxsndupd), R-consistent(Res), event_system{i:l}, R-Feasible{i:l}(R), Rplus(leftright), ecl-machine3(dsdaxTksasnd), ecl-machine2(idsdaxTksaupd), ecl-machine1{$ecl:ut2}(idsdaA), Id, [], cons(carcdr), subtype(ST), top, isect(Ax.B(x)), void, prop{i:l}, l_all(LTx.P(x)), b, (x  l), Type, T, True, <ab>, ecl-kinds(x), x:AB(x), ||as||, ge(ij), P  Q, P  Q, x:A  B(x), left + right, sqequal(st), t  T, sq_type(T), x:AB(x), P  Q, guard(T), type List, Knd, ecl-trans-ks(v), spreadn(ua,b,c,d,e,f,g.v(a;b;c;d;e;f;g)), es realizer ind Rplus compseq tag def, R-compat{i:l}(AB), P  Q, let x,y = A in B(x;y), ecl-trans-type(A), ecl-trans-a(v), , A  B, suptype(ST), ecl-mng-update{i:l}(esidsdaxzupd), update-spec-vars(upd), l-all(Lx.P(x)), ecl-mng-sends{i:l}(esidsdaxlsnd), msg-spec-links(snd), source(l), , A c B, l[i], #$n, a < b, x:AB(x), alle-at(esie.P(e)), with decls ds dasends on l from e include f(e) and only these for tags in tgs, msg-spec-loc(sndi), es-decls(es;i;ds;da), fpf-join(eqfg), fpf-single(xv), es-vartype(esix), idlnk-deq, ecl-tags(lsnd), deq-member(eqxL), loc(e), fpf-sub(Aa.B(a); eqfg), es-E(es), if b then t else f fi , f(a), ecl-m3(asndxl), rcv(l,tg), tagged-list-messages(svL), mapfilter(fPL), es-kind(ese), es-val(ese), es-state-when(ese), es-valtype(ese), es-state(esi), Unit, b, P  Q, e'e.P(e'), fpf-ap(feqx), , @i discrete ds, es-isrcv(ese), product-deq(ABab), es-bact{i:l}(dsdaaesne1e2), eq_id(ab), es-rcvtype(ese), es-acttype(ese), locl(a), tt, ff, es-init(es;e), constant_function(fAB), qle(rs), e < e', val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), Msg(M), kindcase(ka.f(a); l,t.g(l;t)), EState(T), EOrderAxioms(E;pred?;info), decidable(P), case b of inl(x) => s(x) | inr(y) => t(y), let x = a in b(x), concat(ll), map(fas), spreadn(ax,y,z.t(x;y;z)), es-when(esxe), append(asbs), filter(Pl), x(s), es-after(esxe), list_accum(x,a.f(x;a); yl), bor(pq), es-isconst(esix), null(as), ecl ind eclbase compseq tag def, ecl ind eclseq compseq tag def, ecl ind ecland compseq tag def, ecl ind eclor compseq tag def, ecl ind eclrepeat compseq tag def, ecl ind eclact compseq tag def, ecl ind eclthrow compseq tag def, ecl ind eclcatch compseq tag def, rec-case(a) of [] => s | x::y => z.t(x;y;z), es-trans-state-from{i:l}(es;ks;g;z;e1;e2), es-hist{i:l}(es;e1;e2), es-info(es;e), x,yt(x;y), es-le(esee'), atom2-deq-aux, eq_atom{$n:n}(xy)
Lemmasnat sq, subtype-fpf-cap-void, iff wf, eq atom wf2, rev implies wf, atom2-deq-aux, es-le-loc, iff imp equal bool, list accum wf, es-interval-eq, es-le weakening eq, decidable false, le wf, append is nil, ecl wf, ecl-induction, null wf3, es-isconst wf, bor wf, assert of null, or functionality wrt iff, assert of bor, es-after wf, alle-at wf, ecl-mng-update wf, update-spec-vars wf, fpf-ap wf, filter is nil, l member subtype, false wf, fpf-cap-single1, bool sq, bool cases, fpf-join-cap-sq, member wf, deq wf, map wf, append wf, nat properties, subtype rel wf, es-when wf, fpf-sub weakening, fpf-sub-join-left2, decidable equal Id, es-loc-init, es-isrcv-loc, es-init wf, bfalse wf, btrue wf, locl wf, es-acttype wf, es-rcvtype wf, assert-eq-id, es-bact wf, mapfilter wf, subtype rel dep function, product-deq wf, es-isrcv wf, es-state-subtype, es-state-subtype2, bnot wf, assert-deq-member, not functionality wrt iff, assert of bnot, iff transitivity, eqff to assert, eqtt to assert, fpf-single wf, fpf-join wf, es-val wf, es-valtype wf, es-loc wf, es-state wf, tagged-list-messages wf, es-state-when wf, es-kind wf, es-E wf, rcv wf, ecl-m3 wf, deq-member wf, ifthenelse wf, ecl-tags wf, es-sends-iff functionality, Id sq, idlnk-deq wf, member-remove-repeats, es-vartype wf, es-decls-join-single, es-decls-iff, es-decls wf, msg-spec-loc-decl-implies, select wf, length wf1, ecl-mng-sends wf, msg-spec-links wf, l-all-iff, ecl-1-3-compat, R-compat wf, ecl-1-2-compat, subtype rel self, ecl-trans-a wf, ecl-trans-type wf, R-compat-Rplus2, ecl-2-3-compat, Knd sq, cons one one, non neg length, l member wf, top wf, length wf nat, ecl-machine3-realizes, es realizer wf, rationals wf, Id wf, Knd wf, IdLnk wf, decl-type wf, decl-state wf, fpf wf, bool wf, finite-prob-space wf, true wf, squash wf, es realizer ind wf, ecl-machine3 wf, ecl-machine2 wf, Rplus wf, ecl-machine1 wf, R-consistent wf, event system wf, ecl-machine2-realizes, ecl-trans-ks wf, ecl-trans-tuple wf, ecl-trans wf, ecl-kinds-ecl-trans, ecl-machine1-realizes, nat wf, ma-valtype wf, pi2 wf, pi1 wf, msg-item wf, id-deq wf, fpf-cap wf, normal-ds wf, normal-da wf, fpf-trivial-subtype-top, Kind-deq wf, fpf-dom wf, assert wf, lnk wf, ldst wf, isrcv wf, ecl-kinds wf, l all wf2, update-spec-decl wf, msg-spec-loc-decl wf, not wf

origin